0.09/0.14 % Problem : SLH134^1 : TPTP v7.5.0. Released v7.5.0. 0.09/0.16 % Command : run_E %s %d THM 0.15/0.38 % Computer : n022.cluster.edu 0.15/0.38 % Model : x86_64 x86_64 0.15/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.15/0.38 % Memory : 8042.1875MB 0.15/0.38 % OS : Linux 3.10.0-693.el7.x86_64 0.15/0.38 % CPULimit : 30 0.15/0.38 % WCLimit : 30 0.15/0.38 % DateTime : Tue Aug 9 02:30:01 EDT 2022 0.15/0.38 % CPUTime : 0.24/0.53 The problem SPC is TH0_THM_EQU_NAR 0.24/0.53 Running higher-order on 1 cores theorem proving 0.24/0.53 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=1 --cpu-limit=30 /export/starexec/sandbox/benchmark/theBenchmark.p 0.24/0.53 # Version: 3.0pre003-ho 0.46/0.65 # Preprocessing class: HSLSSMSSSSSNSFA. 0.46/0.65 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.46/0.65 # Starting new_ho_11 with 30s (1) cores 0.46/0.65 # new_ho_11 with pid 25004 completed with status 0 0.46/0.65 # Result found by new_ho_11 0.46/0.65 # Preprocessing class: HSLSSMSSSSSNSFA. 0.46/0.65 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.46/0.65 # Starting new_ho_11 with 30s (1) cores 0.46/0.65 # No SInE strategy applied 0.46/0.65 # Search class: HGHSM-FSLF31-MSFFFSBN 0.46/0.65 # Scheduled 5 strats onto 1 cores with 30 seconds (30 total) 0.46/0.65 # Starting new_ho_10 with 17s (1) cores 0.46/0.65 # new_ho_10 with pid 25005 completed with status 0 0.46/0.65 # Result found by new_ho_10 0.46/0.65 # Preprocessing class: HSLSSMSSSSSNSFA. 0.46/0.65 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.46/0.65 # Starting new_ho_11 with 30s (1) cores 0.46/0.65 # No SInE strategy applied 0.46/0.65 # Search class: HGHSM-FSLF31-MSFFFSBN 0.46/0.65 # Scheduled 5 strats onto 1 cores with 30 seconds (30 total) 0.46/0.65 # Starting new_ho_10 with 17s (1) cores 0.46/0.65 # Preprocessing time : 0.005 s 0.46/0.65 # Presaturation interreduction done 0.46/0.65 0.46/0.65 # Proof found! 0.46/0.65 # SZS status Theorem 0.46/0.65 # SZS output start CNFRefutation 0.46/0.65 thf(decl_22, type, minus_minus_nat: nat > nat > nat). 0.46/0.65 thf(decl_23, type, times_times_nat: nat > nat > nat). 0.46/0.65 thf(decl_24, type, zero_zero_nat: nat). 0.46/0.65 thf(decl_25, type, if_nat: $o > nat > nat > nat). 0.46/0.65 thf(decl_26, type, suc: nat > nat). 0.46/0.65 thf(decl_27, type, size_size_list_a: list_a > nat). 0.46/0.65 thf(decl_28, type, ord_less_nat: nat > nat > $o). 0.46/0.65 thf(decl_29, type, divide_divide_nat: nat > nat > nat). 0.46/0.65 thf(decl_30, type, k: nat). 0.46/0.65 thf(decl_31, type, n: nat). 0.46/0.65 thf(decl_32, type, xs: list_a). 0.46/0.65 thf(decl_33, type, esk1_1: (nat > $o) > nat). 0.46/0.65 thf(decl_34, type, esk2_1: (nat > $o) > nat). 0.46/0.65 thf(decl_35, type, esk3_1: nat > nat). 0.46/0.65 thf(decl_36, type, esk4_1: (nat > $o) > nat). 0.46/0.65 thf(decl_37, type, esk5_1: nat > nat). 0.46/0.65 thf(decl_38, type, esk6_1: (nat > $o) > nat). 0.46/0.65 thf(decl_39, type, esk7_1: (nat > nat > $o) > nat). 0.46/0.65 thf(decl_40, type, esk8_1: (nat > nat > $o) > nat). 0.46/0.65 thf(decl_41, type, esk9_1: (nat > nat > $o) > nat). 0.46/0.65 thf(decl_42, type, esk10_1: (nat > nat > $o) > nat). 0.46/0.65 thf(decl_43, type, esk11_1: (nat > $o) > nat). 0.46/0.65 thf(decl_44, type, esk12_1: (nat > $o) > nat). 0.46/0.65 thf(decl_45, type, esk13_3: nat > nat > (nat > $o) > nat). 0.46/0.65 thf(decl_46, type, esk14_3: nat > nat > (nat > $o) > nat). 0.46/0.65 thf(decl_47, type, esk15_3: nat > nat > (nat > nat > $o) > nat). 0.46/0.65 thf(decl_48, type, esk16_3: nat > nat > (nat > nat > $o) > nat). 0.46/0.65 thf(decl_49, type, esk17_3: nat > nat > (nat > nat > $o) > nat). 0.46/0.65 thf(decl_50, type, esk18_3: nat > nat > (nat > nat > $o) > nat). 0.46/0.65 thf(decl_51, type, esk19_2: nat > nat > nat). 0.46/0.65 thf(decl_52, type, esk20_2: nat > (nat > $o) > nat). 0.46/0.65 thf(decl_53, type, esk21_2: nat > (nat > $o) > nat). 0.46/0.65 thf(decl_54, type, esk22_2: nat > (nat > $o) > nat). 0.46/0.65 thf(decl_55, type, esk23_2: nat > (nat > $o) > nat). 0.46/0.65 thf(decl_56, type, esk24_2: nat > nat > nat). 0.46/0.65 thf(decl_57, type, esk25_2: nat > nat > nat). 0.46/0.65 thf(decl_58, type, esk26_2: (nat > $o) > nat > nat). 0.46/0.65 thf(decl_59, type, esk27_1: (nat > nat) > nat). 0.46/0.65 thf(decl_60, type, esk28_1: (nat > nat) > nat). 0.46/0.65 thf(decl_61, type, esk29_2: nat > nat > nat). 0.46/0.65 thf(decl_62, type, esk30_1: nat > nat). 0.46/0.65 thf(decl_63, type, esk31_2: nat > (nat > $o) > nat). 0.46/0.65 thf(decl_64, type, esk32_2: nat > (nat > $o) > nat). 0.46/0.65 thf(decl_65, type, esk33_1: nat > nat). 0.46/0.65 thf(decl_66, type, esk34_2: nat > (nat > $o) > nat). 0.46/0.65 thf(decl_67, type, esk35_2: nat > (nat > $o) > nat). 0.46/0.65 thf(fact_23_diff__Suc__Suc, axiom, ![X2:nat, X1:nat]:(((minus_minus_nat @ (suc @ X2) @ (suc @ X1))=(minus_minus_nat @ X2 @ X1))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_23_diff__Suc__Suc)). 0.46/0.65 thf(fact_82_minus__nat_Odiff__0, axiom, ![X2:nat]:(((minus_minus_nat @ X2 @ zero_zero_nat)=(X2))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_82_minus__nat_Odiff__0)). 0.46/0.65 thf(fact_73_not__less__eq, axiom, ![X2:nat, X1:nat]:((~((ord_less_nat @ X2 @ X1))<=>(ord_less_nat @ X1 @ (suc @ X2)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_73_not__less__eq)). 0.46/0.65 thf(fact_101_diff__less__Suc, axiom, ![X2:nat, X1:nat]:((ord_less_nat @ (minus_minus_nat @ X2 @ X1) @ (suc @ X2))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_101_diff__less__Suc)). 0.46/0.65 thf(conj_2, hypothesis, ((minus_minus_nat @ (suc @ n) @ (suc @ zero_zero_nat))=(minus_minus_nat @ (divide_divide_nat @ (size_size_list_a @ xs) @ k) @ (suc @ zero_zero_nat))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_2)). 0.46/0.65 thf(fact_134_mult_Ocommute, axiom, ((times_times_nat)=(^[X40:nat, X41:nat]:(times_times_nat @ X41 @ X40))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_134_mult_Ocommute)). 0.46/0.65 thf(fact_109_Euclidean__Division_Oless__mult__imp__div__less, axiom, ![X2:nat, X20:nat, X1:nat]:(((ord_less_nat @ X2 @ (times_times_nat @ X20 @ X1))=>(ord_less_nat @ (divide_divide_nat @ X2 @ X1) @ X20))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_109_Euclidean__Division_Oless__mult__imp__div__less)). 0.46/0.65 thf(fact_35_linorder__neqE__nat, axiom, ![X11:nat, X12:nat]:((((X11)!=(X12))=>(~((ord_less_nat @ X11 @ X12))=>(ord_less_nat @ X12 @ X11)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_35_linorder__neqE__nat)). 0.46/0.65 thf(conj_3, conjecture, (ord_less_nat @ (times_times_nat @ n @ k) @ (size_size_list_a @ xs)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_3)). 0.46/0.65 thf(fact_100_diff__less, axiom, ![X1:nat, X2:nat]:(((ord_less_nat @ zero_zero_nat @ X1)=>((ord_less_nat @ zero_zero_nat @ X2)=>(ord_less_nat @ (minus_minus_nat @ X2 @ X1) @ X2)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_100_diff__less)). 0.46/0.65 thf(fact_19_lessI, axiom, ![X1:nat]:((ord_less_nat @ X1 @ (suc @ X1))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_19_lessI)). 0.46/0.65 thf(fact_38_less__irrefl__nat, axiom, ![X1:nat]:(~((ord_less_nat @ X1 @ X1))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_38_less__irrefl__nat)). 0.46/0.65 thf(fact_117_nonzero__mult__div__cancel__left, axiom, ![X8:nat, X10:nat]:((((X8)!=(zero_zero_nat))=>((divide_divide_nat @ (times_times_nat @ X8 @ X10) @ X8)=(X10)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_117_nonzero__mult__div__cancel__left)). 0.46/0.65 thf(conj_0, hypothesis, ((k)!=(zero_zero_nat)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_0)). 0.46/0.65 thf(fact_14_bot__nat__0_Onot__eq__extremum, axiom, ![X8:nat]:((((X8)!=(zero_zero_nat))<=>(ord_less_nat @ zero_zero_nat @ X8))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_14_bot__nat__0_Onot__eq__extremum)). 0.46/0.65 thf(conj_1, hypothesis, ((size_size_list_a @ xs)!=(zero_zero_nat)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_1)). 0.46/0.65 thf(fact_26_mult__0__right, axiom, ![X2:nat]:(((times_times_nat @ X2 @ zero_zero_nat)=(zero_zero_nat))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_26_mult__0__right)). 0.46/0.65 thf(c_0_17, plain, ![X499:nat, X500:nat]:(((minus_minus_nat @ (suc @ X499) @ (suc @ X500))=(minus_minus_nat @ X499 @ X500))), inference(variable_rename,[status(thm)],[fact_23_diff__Suc__Suc])). 0.46/0.65 thf(c_0_18, plain, ![X647:nat]:(((minus_minus_nat @ X647 @ zero_zero_nat)=(X647))), inference(variable_rename,[status(thm)],[fact_82_minus__nat_Odiff__0])). 0.46/0.65 thf(c_0_19, plain, ![X2:nat, X1:nat]:((~(ord_less_nat @ X2 @ X1)<=>(ord_less_nat @ X1 @ (suc @ X2)))), inference(fof_simplification,[status(thm)],[fact_73_not__less__eq])). 0.46/0.65 thf(c_0_20, plain, ![X716:nat, X717:nat]:((ord_less_nat @ (minus_minus_nat @ X716 @ X717) @ (suc @ X716))), inference(variable_rename,[status(thm)],[fact_101_diff__less__Suc])). 0.46/0.65 thf(c_0_21, hypothesis, ((minus_minus_nat @ (suc @ n) @ (suc @ zero_zero_nat))=(minus_minus_nat @ (divide_divide_nat @ (size_size_list_a @ xs) @ k) @ (suc @ zero_zero_nat))), inference(split_conjunct,[status(thm)],[conj_2])). 0.46/0.65 thf(c_0_22, plain, ![X1:nat, X2:nat]:(((minus_minus_nat @ (suc @ X1) @ (suc @ X2))=(minus_minus_nat @ X1 @ X2))), inference(split_conjunct,[status(thm)],[c_0_17])). 0.46/0.65 thf(c_0_23, plain, ![X1:nat]:(((minus_minus_nat @ X1 @ zero_zero_nat)=(X1))), inference(split_conjunct,[status(thm)],[c_0_18])). 0.46/0.65 thf(c_0_24, plain, ![X621:nat, X622:nat]:((((ord_less_nat @ X621 @ X622)|(ord_less_nat @ X622 @ (suc @ X621)))&(~(ord_less_nat @ X622 @ (suc @ X621))|~(ord_less_nat @ X621 @ X622)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])). 0.46/0.65 thf(c_0_25, plain, ![X2:nat, X1:nat]:((ord_less_nat @ (minus_minus_nat @ X1 @ X2) @ (suc @ X1))), inference(split_conjunct,[status(thm)],[c_0_20])). 0.46/0.65 thf(c_0_26, hypothesis, ((minus_minus_nat @ (divide_divide_nat @ (size_size_list_a @ xs) @ k) @ (suc @ zero_zero_nat))=(n)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21, c_0_22]), c_0_23])). 0.46/0.65 thf(c_0_27, plain, ![X455:nat, X456:nat]:(((times_times_nat @ X455 @ X456)=(times_times_nat @ X456 @ X455))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_134_mult_Ocommute])])). 0.46/0.65 thf(c_0_28, plain, ![X2:nat, X1:nat]:((~((ord_less_nat @ X1 @ (suc @ X2)))|~((ord_less_nat @ X2 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_24])). 0.46/0.65 thf(c_0_29, hypothesis, (ord_less_nat @ n @ (suc @ (divide_divide_nat @ (size_size_list_a @ xs) @ k))), inference(spm,[status(thm)],[c_0_25, c_0_26])). 0.46/0.65 thf(c_0_30, plain, ![X737:nat, X738:nat, X739:nat]:((~(ord_less_nat @ X737 @ (times_times_nat @ X738 @ X739))|(ord_less_nat @ (divide_divide_nat @ X737 @ X739) @ X738))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_109_Euclidean__Division_Oless__mult__imp__div__less])])). 0.46/0.65 thf(c_0_31, plain, ![X784:nat, X785:nat]:(((times_times_nat @ X784 @ X785)=(times_times_nat @ X785 @ X784))), inference(variable_rename,[status(thm)],[c_0_27])). 0.46/0.65 thf(c_0_32, plain, ![X11:nat, X12:nat]:((((X11)!=(X12))=>(~(ord_less_nat @ X11 @ X12)=>(ord_less_nat @ X12 @ X11)))), inference(fof_simplification,[status(thm)],[fact_35_linorder__neqE__nat])). 0.46/0.65 thf(c_0_33, negated_conjecture, ~(ord_less_nat @ (times_times_nat @ n @ k) @ (size_size_list_a @ xs)), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_3])])). 0.46/0.65 thf(c_0_34, hypothesis, ~((ord_less_nat @ (divide_divide_nat @ (size_size_list_a @ xs) @ k) @ n)), inference(spm,[status(thm)],[c_0_28, c_0_29])). 0.46/0.65 thf(c_0_35, plain, ![X1:nat, X2:nat, X3:nat]:(((ord_less_nat @ (divide_divide_nat @ X1 @ X3) @ X2)|~((ord_less_nat @ X1 @ (times_times_nat @ X2 @ X3))))), inference(split_conjunct,[status(thm)],[c_0_30])). 0.46/0.65 thf(c_0_36, plain, ![X2:nat, X1:nat]:(((times_times_nat @ X1 @ X2)=(times_times_nat @ X2 @ X1))), inference(split_conjunct,[status(thm)],[c_0_31])). 0.46/0.65 thf(c_0_37, plain, ![X524:nat, X525:nat]:((((X524)=(X525))|((ord_less_nat @ X524 @ X525)|(ord_less_nat @ X525 @ X524)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_32])])). 0.46/0.65 thf(c_0_38, negated_conjecture, ~((ord_less_nat @ (times_times_nat @ n @ k) @ (size_size_list_a @ xs))), inference(split_conjunct,[status(thm)],[c_0_33])). 0.46/0.65 thf(c_0_39, plain, ![X714:nat, X715:nat]:((~(ord_less_nat @ zero_zero_nat @ X714)|(~(ord_less_nat @ zero_zero_nat @ X715)|(ord_less_nat @ (minus_minus_nat @ X715 @ X714) @ X715)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_100_diff__less])])). 0.46/0.65 thf(c_0_40, hypothesis, ~((ord_less_nat @ (size_size_list_a @ xs) @ (times_times_nat @ k @ n))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34, c_0_35]), c_0_36])). 0.46/0.65 thf(c_0_41, plain, ![X2:nat, X1:nat]:((((X1)=(X2))|(ord_less_nat @ X1 @ X2)|(ord_less_nat @ X2 @ X1))), inference(split_conjunct,[status(thm)],[c_0_37])). 0.46/0.65 thf(c_0_42, negated_conjecture, ~((ord_less_nat @ (times_times_nat @ k @ n) @ (size_size_list_a @ xs))), inference(rw,[status(thm)],[c_0_38, c_0_36])). 0.46/0.65 thf(c_0_43, plain, ![X493:nat]:((ord_less_nat @ X493 @ (suc @ X493))), inference(variable_rename,[status(thm)],[fact_19_lessI])). 0.46/0.65 thf(c_0_44, plain, ![X1:nat]:(~(ord_less_nat @ X1 @ X1)), inference(fof_simplification,[status(thm)],[fact_38_less__irrefl__nat])). 0.46/0.65 thf(c_0_45, plain, ![X1:nat, X2:nat]:(((ord_less_nat @ (minus_minus_nat @ X2 @ X1) @ X2)|~((ord_less_nat @ zero_zero_nat @ X1))|~((ord_less_nat @ zero_zero_nat @ X2)))), inference(split_conjunct,[status(thm)],[c_0_39])). 0.46/0.65 thf(c_0_46, hypothesis, ((size_size_list_a @ xs)=(times_times_nat @ k @ n)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40, c_0_41]), c_0_42])). 0.46/0.65 thf(c_0_47, plain, ![X1:nat]:((ord_less_nat @ X1 @ (suc @ X1))), inference(split_conjunct,[status(thm)],[c_0_43])). 0.46/0.65 thf(c_0_48, plain, ![X755:nat, X756:nat]:((((X755)=(zero_zero_nat))|((divide_divide_nat @ (times_times_nat @ X755 @ X756) @ X755)=(X756)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_117_nonzero__mult__div__cancel__left])])). 0.46/0.65 thf(c_0_49, plain, ![X534:nat]:(~(ord_less_nat @ X534 @ X534)), inference(variable_rename,[status(thm)],[c_0_44])). 0.46/0.65 thf(c_0_50, hypothesis, ((ord_less_nat @ n @ (divide_divide_nat @ (times_times_nat @ k @ n) @ k))|~((ord_less_nat @ zero_zero_nat @ (divide_divide_nat @ (times_times_nat @ k @ n) @ k)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45, c_0_26]), c_0_46]), c_0_46]), c_0_47])])). 0.46/0.65 thf(c_0_51, plain, ![X1:nat, X2:nat]:((((X1)=(zero_zero_nat))|((divide_divide_nat @ (times_times_nat @ X1 @ X2) @ X1)=(X2)))), inference(split_conjunct,[status(thm)],[c_0_48])). 0.46/0.65 thf(c_0_52, plain, ![X1:nat]:(~((ord_less_nat @ X1 @ X1))), inference(split_conjunct,[status(thm)],[c_0_49])). 0.46/0.65 thf(c_0_53, hypothesis, ((k)!=(zero_zero_nat)), inference(split_conjunct,[status(thm)],[conj_0])). 0.46/0.65 thf(c_0_54, plain, ![X486:nat]:(((((X486)=(zero_zero_nat))|(ord_less_nat @ zero_zero_nat @ X486))&(~(ord_less_nat @ zero_zero_nat @ X486)|((X486)!=(zero_zero_nat))))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_14_bot__nat__0_Onot__eq__extremum])])). 0.46/0.65 thf(c_0_55, hypothesis, ((size_size_list_a @ xs)!=(zero_zero_nat)), inference(split_conjunct,[status(thm)],[conj_1])). 0.46/0.65 thf(c_0_56, hypothesis, ~((ord_less_nat @ zero_zero_nat @ n)), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50, c_0_51]), c_0_52]), c_0_53])). 0.46/0.65 thf(c_0_57, plain, ![X1:nat]:((((X1)=(zero_zero_nat))|(ord_less_nat @ zero_zero_nat @ X1))), inference(split_conjunct,[status(thm)],[c_0_54])). 0.46/0.65 thf(c_0_58, plain, ![X507:nat]:(((times_times_nat @ X507 @ zero_zero_nat)=(zero_zero_nat))), inference(variable_rename,[status(thm)],[fact_26_mult__0__right])). 0.46/0.65 thf(c_0_59, hypothesis, ((times_times_nat @ k @ n)!=(zero_zero_nat)), inference(rw,[status(thm)],[c_0_55, c_0_46])). 0.46/0.65 thf(c_0_60, hypothesis, ((n)=(zero_zero_nat)), inference(spm,[status(thm)],[c_0_56, c_0_57])). 0.46/0.65 thf(c_0_61, plain, ![X1:nat]:(((times_times_nat @ X1 @ zero_zero_nat)=(zero_zero_nat))), inference(split_conjunct,[status(thm)],[c_0_58])). 0.46/0.65 thf(c_0_62, hypothesis, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59, c_0_60]), c_0_61])]), ['proof']). 0.46/0.65 # SZS output end CNFRefutation 0.46/0.65 # Parsed axioms : 199 0.46/0.65 # Removed by relevancy pruning/SinE : 0 0.46/0.65 # Initial clauses : 309 0.46/0.65 # Removed in clause preprocessing : 30 0.46/0.65 # Initial clauses in saturation : 279 0.46/0.65 # Processed clauses : 625 0.46/0.65 # ...of these trivial : 12 0.46/0.65 # ...subsumed : 187 0.46/0.65 # ...remaining for further processing : 426 0.46/0.65 # Other redundant clauses eliminated : 77 0.46/0.65 # Clauses deleted for lack of memory : 0 0.46/0.65 # Backward-subsumed : 4 0.46/0.65 # Backward-rewritten : 33 0.46/0.65 # Generated clauses : 2953 0.46/0.65 # ...of the previous two non-redundant : 2602 0.46/0.65 # ...aggressively subsumed : 0 0.46/0.65 # Contextual simplify-reflections : 1 0.46/0.65 # Paramodulations : 2868 0.46/0.65 # Factorizations : 2 0.46/0.65 # NegExts : 0 0.46/0.65 # Equation resolutions : 85 0.46/0.65 # Propositional unsat checks : 0 0.46/0.65 # Propositional check models : 0 0.46/0.65 # Propositional check unsatisfiable : 0 0.46/0.65 # Propositional clauses : 0 0.46/0.65 # Propositional clauses after purity: 0 0.46/0.65 # Propositional unsat core size : 0 0.46/0.65 # Propositional preprocessing time : 0.000 0.46/0.65 # Propositional encoding time : 0.000 0.46/0.65 # Propositional solver time : 0.000 0.46/0.65 # Success case prop preproc time : 0.000 0.46/0.65 # Success case prop encoding time : 0.000 0.46/0.65 # Success case prop solver time : 0.000 0.46/0.65 # Current number of processed clauses : 181 0.46/0.65 # Positive orientable unit clauses : 31 0.46/0.65 # Positive unorientable unit clauses: 3 0.46/0.65 # Negative unit clauses : 8 0.46/0.65 # Non-unit-clauses : 139 0.46/0.65 # Current number of unprocessed clauses: 2404 0.46/0.65 # ...number of literals in the above : 7174 0.46/0.65 # Current number of archived formulas : 0 0.46/0.65 # Current number of archived clauses : 204 0.46/0.65 # Clause-clause subsumption calls (NU) : 5112 0.46/0.65 # Rec. Clause-clause subsumption calls : 3836 0.46/0.65 # Non-unit clause-clause subsumptions : 70 0.46/0.65 # Unit Clause-clause subsumption calls : 324 0.46/0.65 # Rewrite failures with RHS unbound : 0 0.46/0.65 # BW rewrite match attempts : 56 0.46/0.65 # BW rewrite match successes : 39 0.46/0.65 # Condensation attempts : 625 0.46/0.65 # Condensation successes : 9 0.46/0.65 # Termbank termtop insertions : 58243 0.46/0.65 0.46/0.65 # ------------------------------------------------- 0.46/0.65 # User time : 0.102 s 0.46/0.65 # System time : 0.013 s 0.46/0.65 # Total time : 0.115 s 0.46/0.65 # Maximum resident set size: 2924 pages 0.46/0.65 0.46/0.65 # ------------------------------------------------- 0.46/0.65 # User time : 0.108 s 0.46/0.65 # System time : 0.016 s 0.46/0.65 # Total time : 0.123 s 0.46/0.65 # Maximum resident set size: 1840 pages 0.46/0.66 EOF